The Combinatory Morphemic Lexicon
نویسنده
چکیده
Grammars that expect words from the lexicon may be at odds with the transparent projection of syntactic and semantic scope relations of smaller units. We propose a morphosyntactic framework based on Combinatory Categorial Grammar that provides flexible constituency, flexible category consistency, and lexical projection of morphosyntactic properties and attachment to grammar in order to establish a morphemic grammar-lexicon. These mechanisms provide enough expressive power in the lexicon to formulate semantically transparent specifications without the necessity to confine structure forming to words and phrases. For instance, bound morphemes as lexical items can have phrasal scope or word scope, independent of their attachment characteristics but consistent with their semantics. The controls can be attuned in the lexicon to language-particular properties. The result is a transparent interface of inflectional morphology, syntax, and semantics. We present a computational system and show the application of the framework to English and Turkish.
منابع مشابه
Compositionnalité morphophonétique de la langue des signes française (LSF) et exploration des relations structurales entre paramètres
Cuxac’s Model predicts that each sign of the LSF lexicon is a combination of morphemic rather than phonemic values. This paper exposes the theoretical principles and conditions of falsifiability we propose to constitute an inventory of morphemic values, their assignation to the parametric components and, in fine, to establish which role is played by the different kinds of constraints exerted on...
متن کاملStructure, form, and meaning in the mental lexicon: evidence from Arabic
Does the organization of the mental lexicon reflect the combination of abstract underlying morphemic units or the concatenation of word-level phonological units? We address these fundamental issues in Arabic, a Semitic language where every surface form is potentially analyzable into abstract morphemic units - the word pattern and the root - and where this view contrasts with stem-based approach...
متن کاملInduction of Linguistic Structure with Combinatory Categorial Grammars
Our system consists of a simple, EM-based induction algorithm (Bisk and Hockenmaier, 2012), which induces a language-specific Combinatory Categorial grammar (CCG) and lexicon based on a small number of linguistic principles, e.g. that verbs may be the roots of sentences and can take nouns as arguments.
متن کاملA Supervised Semantic Parsing with Lexicon Extension and Syntactic Constraint
Existing semantic parsing research has steadily improved accuracy on a few domains and their corresponding meaning representations. In this paper, we present a novel supervised semantic parsing algorithm, which includes the lexicon extension and the syntactic supervision. This algorithm adopts a large-scale knowledge base from the open-domain Freebase to construct efficient, rich Combinatory Ca...
متن کاملAutomatic Induction of a CCG Grammar for Turkish
This paper presents the results of automatically inducing a Combinatory Categorial Grammar (CCG) lexicon from a Turkish dependency treebank. The fact that Turkish is an agglutinating free wordorder language presents a challenge for language theories. We explored possible ways to obtain a compact lexicon, consistent with CCG principles, from a treebank which is an order of magnitude smaller than...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computational Linguistics
دوره 28 شماره
صفحات -
تاریخ انتشار 2002